#include <iostream>
#include <fstream>
using namespace std;

int a[20]={12,15,15,20,20,20,23,34,35,37,
           40,40,40,40,45,50,50,55,60,70};
int n=20;

int binary_search(int p, int q, int x)
{ while(p<=q)
  { int m=(p+q)/2;
    if(x==a[m]) return m;
    if(x<a[m]) q=m-1;
    else p=m+1;
  }  

  return -1;
}    

int main()
{
  int x;
  cin >> x;
  while(x>=0)
  { int p = binary_search(0,n-1,x);
    if(p>=0) cout << "Yes " << p << endl;
    else cout << "No" << endl;
    cin >> x;
  }
  
  return 0;
}
  


